Computational complexity of mathematical operations

Results: 76



#Item
71Analysis of algorithms / Operations research / Computational complexity theory / Algorithm / Time complexity / Numerical analysis / Fast Fourier transform / Mathematical optimization / Applied mathematics / Theoretical computer science / Mathematics

235 Doc. Math. J. DMV

Add to Reading List

Source URL: www.mathunion.org

Language: English - Date: 2012-04-18 10:55:30
72NP-complete problems / Operations research / Combinatorial optimization / Mathematical optimization / Complexity classes / NP-complete / Maximum cut / Approximation algorithm / Algorithm / Theoretical computer science / Mathematics / Computational complexity theory

The Design of Approximation Algorithms

Add to Reading List

Source URL: www.designofapproxalgs.com

Language: English - Date: 2013-10-23 21:30:01
73Mathematics / Mathematical optimization / Analysis of algorithms / Operations research / Smoothed analysis / Daniel Spielman / Linear programming / Shang-Hua Teng / Algorithm / Theoretical computer science / Applied mathematics / Computational complexity theory

2008 G¨odel Prize Citation The 2008 G¨

Add to Reading List

Source URL: www.eatcs.org

Language: English - Date: 2009-11-03 08:49:32
74Operations research / Convex optimization / Linear programming / Computational complexity theory / Mathematical optimization / Smoothed analysis / Simplex algorithm / Simplex / Normal distribution / Mathematics / Geometry / Applied mathematics

Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time DANIEL A. SPIELMAN

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 2007-02-04 13:37:47
75Operations research / Linear programming / Combinatorial optimization / Optimization problem / Mathematical optimization / Simplex algorithm / Computational complexity theory / Travelling salesman problem / Algorithm / Theoretical computer science / Mathematics / Applied mathematics

"Shortest Path problem, the Traveling Salesman problem, or the Knapsack problem, are a few of the many combinatorial optimization problems, which have very wide applications in all spheres of our lives. Unfortunately, there is a large class of problems, denoted by class NP, for

Add to Reading List

Source URL: www.iitk.ac.in

Language: English - Date: 2004-12-03 00:57:05
76Integer sequences / Logarithms / Factorial / Computational complexity of mathematical operations / Chebyshev function / Mathematics / Number theory / Information theory

PDF Document

Add to Reading List

Source URL: www.renyi.hu

Language: English - Date: 2006-11-05 15:15:43
UPDATE